Two-Variable Logic over Countable Linear Orderings
نویسندگان
چکیده
We study the class of languages of finitely-labelled countable linear orderings definable in twovariable first-order logic. We give a number of characterisations, in particular an algebraic one in terms of circle monoids, using equations. This generalises the corresponding characterisation, namely variety DA, over finite words to the countable case. A corollary is that the membership in this class is decidable: for instance given an MSO formula it is possible to check if there is an equivalent two-variable logic formula over countable linear orderings. In addition, we prove that the satisfiability problems for two-variable logic over arbitrary, countable, and scattered linear orderings are Nexptime-complete. 1998 ACM Subject Classification F.4.3 Formal Languages
منابع مشابه
Regular Languages of Words over Countable Linear Orderings
We develop an algebraic model for recognizing languages of words indexed by countable linear orderings. This notion of recognizability is effectively equivalent to definability in monadic second-order (MSO) logic. The proofs also imply the first known collapse result for MSO logic over countable linear orderings.
متن کاملLimited Set quantifiers over Countable Linear Orderings
In this paper, we study several sublogics of monadic secondorder logic over countable linear orderings, such as first-order logic, firstorder logic on cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic secondorder logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these log...
متن کاملLogic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
In this paper we consider languages of labelled N -free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only if it is recognizable by a finite depth-nilpotent algebra if and only if it is bounded-width and monadic second-order definable. This extends previous results on languages of labelled N -free finite and ω-posets and ...
متن کاملEquivalence between Fraïssé's conjecture and Jullien's theorem
We say that a linear ordering L is extendible if every partial ordering that does not embed L can be extended to a linear ordering which does not embed L either. Jullien’s theorem is a complete classification of the countable extendible linear orderings. Fräıssé’s conjecture, which is actually a theorem, is the statement that says that the class of countable linear ordering, quasiordered by the...
متن کاملFactorization forests for infinite words and applications to countable scattered linear orderings
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations — à la Ramsey — for finite words. This theorem has important applications in semigroup theory, and beyond. We provide two improvements to the standard result. First we improve on all previously known bounds. Second, we extend it to ‘every linear ordering’. We use this last variant in a simplified pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016